Topological and Structural Properties of Butterfly-de-Bruin: A Product Network of Wrap-Around Butterfly and de Bruin Networks

نویسندگان

  • Osman Guzide
  • Weidong Liao
چکیده

This paper proposes and analyzes a novel interconnection network called Butterfly-de-Bruijn, which is a Product of wrap-around Butterfly and de Bruijn Networks. This new network, as a product of Butterfly (Bn) and de Bruijn (Dn) networks of degree n and denoted as BnDn, provides the connection among n2 2 nodes with a diameter of |_3n/2_|, same as butterfly network, and a constant node degree of 8. We show that BnDnis symmetric, even though it is a product of symmetric and non-symmetric networks, and it contains 2 distinct copies of Bn (wraparound Butterfly Network). Also shown in this paper is that BnDn supports all cycle sub graphs except those of odd lengths when n is even and of odd lengths less than n.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a Product Network of Enhanced Wrap-Around Butterfly and de Bruijn Networks

The topological structures of conventional Interconnection networks, such as Mesh, have recently been adopted in emerging areas such as wireless sensor networks, the pervasive computing and the Internet of Things. In this paper, we propose and analyze a novel Interconnection network topology called Enhanced Butterfly-de-Bruijn (denoted as EBnDn), which is the Product of Enhanced wrap-around But...

متن کامل

Comments on "A New Family of Cayley Graph Interconnection Networks of Constant Degree Four"

Vadapalli and Srimani [2] have proposed a new family of Cayley graph interconnection networks of constant degree four. Our comments show that their proposed graph is not new but is the same as the wrap-around butterfly graph. The structural kinship of the proposed graph with the de Bruijn graph is also discussed.

متن کامل

Embedding Complete Binary Trees into Butterfly Networks

In this paper we present embeddings of complete binary trees into butterfly networks with or without wrap-around connections. Let m be an even integer and q = m+ LlogmJ-l. We show how to embed a 2+I -I-node complete binary tree T(q) into a (m + 1)2111+1_ node wrap-around butterfly B1l1(m +1) with a dilation of 4, and how to embed T(q) into a (m + 2)2+_node wrap-around butterfly B 1l1 (m +2) wit...

متن کامل

Modelling the Progression of Male Swimmers’ Performances through Adolescence

Insufficient data on adolescent athletes is contributing to the challenges facing youth athletic development and accurate talent identification. The purpose of this study was to model the progression of male sub-elite swimmers’ performances during adolescence. The performances of 446 males (12–19 year olds) competing in seven individual events (50, 100, 200 m freestyle, 100 m backstroke, breast...

متن کامل

Enhanced butterfly: A cayley graph with node degree 5

We describe a new interconnection network called the Enhanced Butterfly (EBn). It is a Cayley graph with n2 nodes, each incident with five edges. This new network has a diameter n which compares favorably to the wrap-around butterfly (Bn) with the same number of nodes and a diameter of b3n/2c. Bn is a subgraph of EBn. The simple and optimal routing algorithms for this network are presented.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017